Trees within trees: simple nested coalescents
نویسندگان
چکیده
منابع مشابه
Beta-coalescents and continuous stable random trees
Coalescents with multiple collisions, also known as Λ-coalescents, were introduced by Pitman and Sagitov in 1999. These processes describe the evolution of particles that undergo stochastic coagulation in such a way that several blocks can merge at the same time to form a single block. In the case that the measure Λ is the Beta(2 − α, α) distribution, they are also known to describe the genealo...
متن کاملΒ-coalescents and Stable Galton-watson Trees
Representation of coalescent process using pruning of trees has been used by Goldschmidt and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the β(3/2, 1/2)-coalescent. By considering a pruning procedure on stable GaltonWatson tree with n labeled leaves, we give a representation of the discrete β(1 + α, 1− α)coalescent, with α ∈ [1/2, 1) starting from the trivial par...
متن کاملBeta-coalescents in continuum Lévy trees
Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a Beta(3/2, 1/2)coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous’s continuumrandom tree, to construct a continuous state space process that has the same structure as the beta-coalescent process up to some time chan...
متن کاملApproximation of trees by self-nested trees
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of trees. We show that self-nested trees may be considered as an approximation class of unordered trees. We compare our approximation algorithms with a competitive ...
متن کاملNested Junction Trees
The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy archi tectures can be improved by exploiting the independence relations induced by the incom ing messages of a clique. That is, the mes sage to be sent from a clique can be com puted via a factorization of the clique poten tial in the form of a junction tree. In this pa per we show that by exploiting such n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2018
ISSN: 1083-6489
DOI: 10.1214/18-ejp219